منابع مشابه
Fast and Oblivious Convolution Quadrature
We give an algorithm to compute N steps of a convolution quadrature approximation to a continuous temporal convolution using only O(N logN) multiplications and O(logN) active memory. The method does not require evaluations of the convolution kernel, but instead O(logN) evaluations of its Laplace transform, which is assumed sectorial. The algorithm can be used for the stable numerical solution w...
متن کاملFast convolution quadrature based impedance boundary conditions
We consider an eddy current problem in time-domain relying on impedance boundary conditions on the surface of the conductor(s). We pursue its full discretization comprising (i) a finite element Galerkin discretization by means of lowest order edge elements in space, and (ii) temporal discretization based on Runge-Kutta convolution quadrature (CQ) for the resulting Volterra integral equation in ...
متن کاملAdaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) operations and O(log N) active memory, in place of O(N) operations and O(N) memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differenti...
متن کاملFast convolution quadrature for the wave equation in three dimensions
This work addresses the numerical solution of time-domain boundary integral equations arising from acoustic and electromagnetic scattering in three dimensions. The semidiscretization of the time-domain boundary integral equations by Runge-Kutta convolution quadrature leads to a lower triangular Toeplitz system of size N . This system can be solved recursively in an almost linear time (O(N logN)...
متن کاملFast Convolution
We present a very simple and fast algorithm to compute the convolution of an arbitrary sequence x with a sequence of a specific type, a. The sequence a is any linear combination of polynomials, exponentials and trigonometric terms. The number of steps for computing the convolution depends on a certain complexity of a and not on its length, thus making it feasible to convolve a sequence with ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2006
ISSN: 1064-8275,1095-7197
DOI: 10.1137/050623139